新型树启发式搜索算法的机器人路径规划

面对三维空间移动机器人从起始点到终止点的最短路径问题,提出一种新型的边缘点树启发式搜索(TreeEP)算法,该方法将地图空间进行密度可调的三维离散化处理,根据障碍安全距离筛选出障碍物的可靠边缘点信息,再利用树扩散架构选出最能引导搜索方向的潜力点进行扩散搜索,最终得出最短路径。提出局部调整策略,得到改进的Tree-EP算法。实验结果表明,在带障碍复杂地形最短路径搜索应用中,提出的Tree-EP算法与已有方法相比,能找到更短的移动路径。     

基于伪布尔模型和启发式算法求解无容量设施选址问题

采用伪布尔模型和启发式算法来求解无容量设施选址问题。首先给出了问题的伪布尔(pseudo-Boolean)表示，然后基于Khumawala规则对问题进行预处理，最后提出两种启发式分支准则来求解问题。实验结果表明所提算法简单有效。     

The structural variability of quarters and residential areas in the historical texture of the city of Yazd based on Islamic rules and jurisprudence: a case study of Golchinan quarter

According to many researchers and scholars, religious beliefs can be considered as the most influential factor in forming Muslim urban spaces and their architectural elements. In fact, historical cities reflect the culture and beliefs of their residences. Among all historical places in Iranian cities, the historical texture of the city of Yazd, especially the quarters since the age of Qajar dynasty, are well preserved. The present study aims at identifying the Islamic principles and values influencing the formation of architectural spaces and the extent of their applications in one of the historical quarters known as Golchinan. The results of the conformation of the theoretical findings with the data acquired from field studies revealed that almost 90% of the urban and architectural spaces (e.g. residential areas, mosques, bazaars, and pathways) in Yazd are directly influenced by Islamic principles. In other words, there is a strong conformity between the accepted Islamic values of the society and what actually was applied to urban constructions during Qajar dynasty.     

Title加TextRank抽取关键句的情感分类研究

考虑到不同句子对判断文档情感倾向的重要程度不同，因而区分文档的关键句和细节句将有助于提高情感分类的性能。同时，考虑到Title和上下文信息，提出了一种基于Title和加权TextRank抽取关键句的情感分析方法SKTT，实现了高效的情感分析。根据文档Title的情感权重计算Title贡献度，考虑到标点和语义规则对情感倾向的影响；根据加权TextRank算法思想，在文档正文中构建了一个情感句有向图来提取关键句；计算所有关键句的情感倾向进行情感分类。在4个领域上进行实验，实验结果表明，该SKTT方法性能明显优于Baseline，具有高效性。     

基于改进蚁群算法的三维路径规划

针对移动机器人在海水环境中的三维路径规划问题容易陷入局部最优和收敛慢等瑕疵，根据三维环境全局信息来改进蚁群算法以提高实时性和收敛速度。改进蚁群算法的启发函数，采用局部信息和全局信息结合动态地改进信息素更新方式，以及根据三维空间中路径的平坦程度和光滑度二阶微分分别增加了一阶微分和二阶微分来再次修改信息素更新规则。仿真对比实验结果显示改进后的蚁群算法克服了收敛速度慢、容易陷入局部最优的缺点。     

基于变量决策层的启发式变量选择策略

启发式分支策略是SAT求解器中不可或缺的一部分，直接影响求解器的效率。早期的启发式分支决策需要遍历整个子句数据库，效率比较低。随着独立变量状态衰减和（Variable State Independent Decaying Sum, VSIDS）分支策略的出现，SAT求解器的效率有所提高，但VSIDS策略以及它的延伸策略中变量的增量都只是与变量的冲突次数有关，没有考虑变量的决策层在分支策略中的影响。因此当发生冲突时，如果与冲突有关的变量的得分相同而决策层不同时，对于变量的选择就具有随机性。基于此，本文在阐述变量的决策层的重要性之后在VSIDS策略的基础上，提出一种基于变量决策层的启发式变量选择策略--HSVDL策略。然后通过实例显示HSVDL策略在变量决策阶段选择决策层低的变量的可能性比选择决策层高的变量的可能性要大，而且得分比较小，减少了内存的占用。最后通过实验表明HSVDL策略能够求解出更多的实例，求解器的效率也有所提高，说明该策略有一定的优势。     

Discovery of path-attribute dependency in manufacturing environments: A process mining approach

The more knowledge industrial practitioners detain of their production processes, the more they are capable of performing process improvements. Nonetheless, there may exist process characteristics and dependencies that are not easily extractable from business models, such as routing dependent attributes. This paper introduces an algorithm-driven framework to establish whether process path decisions influence the attributes in non-direct sequences, e.g., deploying machine A instead of machine B affects the % of rejected parts on the process, 4 stages down the line. This problem is shown to bears similarities with sequential pattern mining problems. The basis of the solution framework relies on process mining and data mining techniques. The approach proposed is applied on a real industrial log, unveiling deficiencies in the system and providing further improvement recommendations.     

水产品及养殖水中丁香酚类化合物风险研究

目的 检测水产品及养殖水中丁香酚类化合物。方法 应用食品补充检验方法BJS 201908《水产品及水中丁香酚类化合物的测定》，以海水鱼、淡水鱼、海水虾、淡水虾及养殖水作为基质，测定6种丁香酚类化合物的含量。结果 通过对实际样品测定后发现，在水产品中检出了丁香酚类化合物，主要为丁香酚，检出率为28.9%，其中海水鱼相对突出。结论 本研究为丁香酚作为渔用麻醉剂提供了方法论，为丁香酚类化合物在水产运输的合理使用提供理论依据。     

An energy-efficient two-stage hybrid flow shop scheduling problem in a glass production

Energy-efficient scheduling is highly necessary for energy-intensive industries, such as glass, mould or chemical production. Inspired by a real-world glass-ceramics production process, this paper investigates a bi-criteria energy-efficient two-stage hybrid flow shop scheduling problem, in which parallel machines with eligibility are at stage 1 and a batch machine is at stage 2. The performance measures considered are makespan and total energy consumption. Time-of-use (TOU) electricity prices and different states of machines (working, idle and turnoff) are integrated. To tackle this problem, a mixed integer programming (MIP) is formulated, based on which an augmented ε-constraint (AUGMECON) method is adopted to obtain the exact Pareto front. A problem-tailored constructive heuristic method with local search strategy, a bi-objective tabu search algorithm and a bi-objective ant colony optimisation algorithm are developed to deal with medium- and large-scale problems. Extensive computational experiments are conducted, and a real-world case is solved. The results show effectiveness of the proposed methods, in particular the bi-objective tabu search.     

Neural network based non-invasive method to detect anemia from images of eye conjunctiva

Detection of anemia can be done by examining the hemoglobin concentration level in the blood using complete blood count, which is an invasive, time-consuming, and costly technique. Preliminary methods for detecting anemia include examining the color of the palpebral conjunctiva, which is a non-invasive method, but color perception may vary from person to person. This study aims to develop a computerized non-invasive technique for anemia detection. We propose a novel machine learning model using the artificial neural network to detect anemic patients from the images of eye conjunctiva. Since limited and small dataset has been used in the earlier approaches, this may cause over fitting of the model. We have improved the number of available training images using image augmentation techniques. To standardize a non-invasive method, we have used computer vision algorithms for preprocessing and feature extraction. This article derives the backpropagation rules mathematically for adjusting the weights for the proposed neural network model. After hyper parameter tuning and using the mathematically derived backpropagation rules, the model was able to achieve the best accuracy of 97.00% with sensitivity 99.21% and specificity 95.42% on the created dataset.